The Problem of Mass: Mesonic Bound States Above
نویسندگان
چکیده
منابع مشابه
5 The Problem of Mass : Mesonic Bound States
We discuss the problem of mass, noting that meson masses decrease with increasing scale as the dynamically generated condensate of “soft glue” is melted (Brown/Rho scaling). We then extend the Bielefeld LGS color singlet interaction computed for heavy quarks in a model-dependent way by including the Ampére law velocityvelocity interaction. Parameterizing the resulting interaction in terms of ef...
متن کاملA ug 2 00 5 The Problem of Mass : Mesonic Bound States
We discuss the problem of mass, noting that meson masses decrease with increasing scale as the dynamically generated condensate of “soft glue” is melted (Brown/Rho scaling). We then extend the Bielefeld LGS (Lattice Gauge Simulation) color singlet interaction computed for heavy quarks in a model-dependent way by including the Ampére law velocity-velocity interaction. Parameterizing the resultin...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولDirected Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
An oriented graph is a directed graph without directed 2-cycles. Poljak and Turzík (1986) proved that every connected oriented graph G on n vertices and m arcs contains an acyclic subgraph with at least m2 + n−1 4 arcs. Raman and Saurabh (2006) gave another proof of this result and left it as an open question to establish the parameterized complexity of the following problem: does G have an acy...
متن کاملMaximum Balanced Subgraph Problem Parameterized above Lower Bound
We consider graphs without loops or parallel edges in which every edge is assigned + or −. Such a signed graph is balanced if its vertex set can be partitioned into parts V1 and V2 such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign − (one of the parts may be empty). It is well-known that every connected signed graph with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics A
سال: 2006
ISSN: 0375-9474
DOI: 10.1016/j.nuclphysa.2006.06.159